/* ========================================================================
 * PlantUML : a free UML diagram generator
 * ========================================================================
 *
 * Project Info:  http://plantuml.com
 * 
 * This file is part of Smetana.
 * Smetana is a partial translation of Graphviz/Dot sources from C to Java.
 *
 * (C) Copyright 2009-2017, Arnaud Roques
 *
 * This translation is distributed under the same Licence as the original C program:
 * 
 *************************************************************************
 * Copyright (c) 2011 AT&T Intellectual Property 
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors: See CVS logs. Details at http://www.graphviz.org/
 *************************************************************************
 *
 * THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
 * LICENSE ("AGREEMENT"). [Eclipse Public License - v 1.0]
 * 
 * ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
 * RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
 * 
 * You may obtain a copy of the License at
 * 
 * http://www.eclipse.org/legal/epl-v10.html
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 */
package h;
import java.util.Arrays;
import java.util.List;

import smetana.core.__ptr__;

//2 6erg9dnjb8l3vavlty90aui6v

public interface RTree extends __ptr__ {
	public static List<String> DEFINITION = Arrays.asList(
"struct RTree",
"{",
"Node_t *root",
"SplitQ_t split",
"int MinFill",
"long ElapsedTime",
"float UserTime, SystemTime",
"int Deleting",
"int StatFlag",
"int InsertCount",
"int DeleteCount",
"int ReInsertCount",
"int InSplitCount",
"int DeSplitCount",
"int ElimCount",
"int EvalCount",
"int InTouchCount",
"int DeTouchCount",
"int SeTouchCount",
"int CallCount",
"float SplitMeritSum",
"int RectCount",
"int NodeCount",
"int LeafCount, NonLeafCount",
"int EntryCount",
"int SearchCount",
"int HitCount",
"}");
}

// struct RTree {
//     Node_t *root;
// 
//     SplitQ_t split;
// 
//     /* balance criterion for node splitting */
//     int MinFill;
// 
//     /* times */
//     long ElapsedTime;
//     float UserTime, SystemTime;
// 
//     int Deleting;
// 
//     /* variables for statistics */
//     int StatFlag;		/* tells if we are counting or not */
//     /* counters affected only when StatFlag set */
//     int InsertCount;
//     int DeleteCount;
//     int ReInsertCount;
//     int InSplitCount;
//     int DeSplitCount;
//     int ElimCount;
//     int EvalCount;
//     int InTouchCount;
//     int DeTouchCount;
//     int SeTouchCount;
//     int CallCount;
//     float SplitMeritSum;
// 
//     /* counters used even when StatFlag not set */
//     int RectCount;
//     int NodeCount;
//     int LeafCount, NonLeafCount;
//     int EntryCount;
//     int SearchCount;
//     int HitCount;
// 
// };